package J3_23;

import java.util.Scanner;

public class test2 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...
        int t = scan.nextInt();
        while (t-- > 0) {
            int n = scan.nextInt();
            int x = scan.nextInt();
            int[] arr = new int[n + 1];
            arr[0] = 0;
            for (int i = 1; i <= n; i++) {
                arr[i] = scan.nextInt();
            }
            if(canArrive(0,arr,x,0) ) {
                System.out.println("Yes");
            }else {
                System.out.println("No");
            }
        }
        scan.close();
    }
    public static boolean canArrive(int index, int[] arr, int x,int sum) {
        if (index == arr.length-2) {
            if (sum + arr[index] == x) {
                return true;
            }
            return canArrive(index + 1,arr,x, sum + arr[index]);
        }
        if(index == arr.length-1) {
            return sum + arr[index] == x;
        }
        if (canArrive(index + 1,arr,x, sum + arr[index])) return true;
        return canArrive(index + 2, arr, x, sum + arr[index]);
    }
}
